Generating Uniformly Distributed Pareto Optimal Points for Constrained and Unconstrained Multicriteria Optimization
نویسندگان
چکیده
This paper proposes a novel approach to generate a uniform distribution of the optimal solutions along the Pareto frontier. We make use of a standard mathematical technique for optimization namely line search and adapt it so that it will be able to generate a set of solutions uniform distributed along the Pareto front. To validate the method, numerical bi-criteria examples are considered. The method deals with both unconstrained as well as constrained multicriteria optimization problems.
منابع مشابه
On Robust Optimization - Relations Between Scalar Robust Optimization and Unconstrained Multicriteria Optimization
We introduce an unconstrained multicriteria optimization problem and discuss its relation to various well-known scalar robust optimization problems with a finite uncertainty set. Specifically, we show that a unique solution of a robust optimization problem is Pareto optimal for the unconstrained optimization problem. Furthermore, it is demonstrated that the set of weakly Pareto optimal solution...
متن کاملNormal-boundary Intersection: an Alternate Method for Generating Pareto Optimal Points in Multicriteria Optimization Problems
This paper proposes an alternate method for nding several Pareto optimal points for a general nonlinear multicriteria optimization problem, aimed at capturing the tradeo among the various con icting objectives. It can be rigorously proved that this method is completely independent of the relative scales of the functions and is quite successful in producing an evenly distributed set of points in...
متن کاملA Method for Constrained Multiobjective Optimization Based on SQP Techniques
We propose a method for constrained and unconstrained nonlinear multiobjective optimization problems that is based on an SQP-type approach. The proposed algorithm maintains a list of nondominated points that is improved both for spread along the Pareto front and optimality by solving single-objective constrained optimization problems. These single-objective problems are derived as SQP problems ...
متن کاملImproved Regularity Model-based EDA for Many-objective Optimization
The performance of multi-objective evolutionary algorithms deteriorates appreciably in solving many-objective optimization problems which encompass more than three objectives. One of the known rationales is the loss of selection pressure which leads to the selected parents not generating promising offspring towards Pareto-optimal front with diversity. Estimation of distribution algorithms sampl...
متن کاملOn Constrained Boolean Pareto Optimization
Pareto optimization solves a constrained optimization task by reformulating the task as a bi-objective problem. Pareto optimization has been shown quite effective in applications; however, it has little theoretical support. This work theoretically compares Pareto optimization with a penalty approach, which is a common method transforming a constrained optimization into an unconstrained optimiza...
متن کامل